Primal separation for 0/1 polytopes
نویسندگان
چکیده
منابع مشابه
Primal separation for 0/1 polytopes
The 0/1 primal separation problem is: Given an extreme point x̄ of a 0/1 polytope P and some point x , find an inequality which is tight at x̄, violated by x and valid for P or assert that no such inequality exists. It is known that this separation variant can be reduced to the standard separation problem for P. We show that 0/1 optimization and 0/1 primal separation are polynomial time equivalen...
متن کاملPrimal separation algorithms
Given an integer polyhedron PI ⊂ R, an integer point x̄ ∈ PI , and a point x∗ ∈ R \ PI , the primal separation problem is the problem of finding a linear inequality which is valid for PI , violated by x∗, and satisfied at equality by x̄. The primal separation problem plays a key role in the primal approach to integer programming. In this paper we examine the complexity of primal separation for se...
متن کاملSeparation algorithms for 0-1 knapsack polytopes
Valid inequalities for 0-1 knapsack polytopes often prove useful when tackling hard 0-1 Linear Programming problems. To use such inequalities effectively, one needs separation algorithms for them, i.e., routines for detecting when they are violated. We show that the separation problems for the so-called extended cover and weight inequalities can be solved exactly in O(nb) time and O((n+ amax)b)...
متن کامل8 Determining the Separation of Polytopes
23 All of the subproblems implied by the above sketch of the algorithm may be solved recur-sively, with the recursion terminating by using a \brute force" approach for suitably simple polytopes. If T(n A ; n B) is the expected time necessary to determine a separation pair for polytopes A and B with n A = j m (B(A))j and n B = j m (B(B))j, then The rst term in the bound is the time necessary to ...
متن کامل1 M ar 2 01 1 Linear inverse problems with noise : primal and primal - dual splitting
In this paper, we propose two algorithms for solving linear inverse problems when the observations are corrupted by noise. A proper data fidelity term (log-likelihood) is introduced to reflect the statistics of the noise (e.g. Gaussian, Poisson). On the other hand, as a prior, the images to restore are assumed to be positive and sparsely represented in a dictionary of waveforms. Piecing togethe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2003
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-002-0309-y